On slowly increasing unbounded harmonic functions

Unbounded Recursion and Non-size-increasing Functions

We investigate the computing power of function algebras defined by means of unbounded recursion on notation. We introduce two function algebras which contain respectively the regressive logspace computable functions and the non-size-increasing logspace computable functions. However, such algebras are unlikely to be contained in the set of logspace computable functions because this is equivalent...

p(x)-HARMONIC FUNCTIONS WITH UNBOUNDED EXPONENT IN A SUBDOMAIN

Abstract. We study the Dirichlet problem − div(|∇u|∇u) = 0 in Ω, with u = f on ∂Ω and p(x) = ∞ in D, a subdomain of the reference domain Ω. The main issue is to give a proper sense to what a solution is. To this end, we consider the limit as n → ∞ of the solutions un to the corresponding problem when pn(x) = p(x)∧ n, in particular, with p = n in D. Under suitable assumptions on the data, we fin...

More on Harmonic Functions

On Univalent Harmonic Functions

Two classes of univalent harmonic functions on unit disc satisfying the conditions ∑∞ n=2(n−α)(|an|+|bn|) ≤ (1−α)(1−|b1|) and ∑∞ n=2 n(n−α)(|an|+|bn|) ≤ (1−α)(1−|b1|) are given. That the ranges of the functions belonging to these two classes are starlike and convex, respectively. Sharp coefficient relations and distortion theorems are given for these functions. Furthermore results concerning th...

On Harmonic Functions on Trees

By a tree T we mean a connected graph such that every subgraph obtained from T by removing any of its edges is not connected. In what follows we will only consider trees in which we distinguish a vertex v0 as an origin. As usual we denote by V and E the set of vertices and the set of edges (respectively) of the tree. If v and w are the boundary vertices of an edge, we say that they are neighbou...